A Normal Form for Algebraic Constructions
نویسنده
چکیده
By a " construction " we mean here a function which takes each structure of one type to some structure of another type; " algebraic " means " such as occurs in algebra ". One example of an algebraic construction is the function F which takes each integral domain R to its field of fractions F(R). Word-constructions, defined below, yield a normal form for algebraic constructions; they also constitute a new method of model construction, generalising the notion of construction by generators and relations (cf. Q-word algebras, Cohn [1]). At the end we list a few applications, which range from technical (preservation theorems for infinitary languages) to foundational (degrees of constructivity). By a similarity type we shall mean a set of function symbols, each with an assigned arity ^ 0. It is clear what is meant by an Cl-structure, i.e. a universal algebra of similarity type Q. Let £, Q be fixed similarity types, and let S be a set of symbols not occurring in Q. By a. frame we shall mean a finite sequence, written £(vlt ...,vk), each of whose terms is either a function symbol from Q, a symbol from S, or a variable from among vu ..., vk; we require also that each variable vu...tvk occurs just once in £(vlt ...,vk). If 51 is a E-structure and au...,ak are elements of the domain of % then by £[alt .-.,ak] we mean the sequence which results from £(vit ...,vk) after replacing the occurrence of vt by an occurrence of a,, for each i. By a word-construction from E to Q, we mean a sequence F = , where
منابع مشابه
An elementary proof that upper and lower powerdomain constructions commute
It was proved in [1] that lower and upper powerdomain constructions commute on all domains. In that proof, domains were represented as information systems. In [2] a rather complicated algebraic proof was given which relied on universality properties of powerdomains proved in the previous works of the author of [2]. Here we give an elementary algebraic proof that upper and lower powerdomain cons...
متن کاملSolving Polynomial System Efficiently and Accurately
We consider the problem of finding the isolated common roots of a set of polynomial functions defining a zero-dimensional ideal I in a ring R of polynomials over C. Normal form algorithms provide an algebraic approach to solve this problem. We use new characterizations of normal forms and describe accurate and efficient constructions that allow us to compute the algebra structure of R/I, and he...
متن کاملAlgebraic Constructions: A Simple Framework for Complex Dependencies and Parameterisation
We propose a simple framework of algebraic constructions for software specification, modular design and development. Algebraic constructions generalise (parameterised) modules by allowing on one hand a rather arbitrary collection of elements to form the parameter and on the other hand dependencies between the module elements to be spelled out explicitly. Algebraic constructions are specified in...
متن کاملMonotonic Modal Logics
Monotonic modal logics form a generalisation of normal modal logics in which the additivity of the diamond modality has been weakened to monotonicity: 3p∨3q → 3(p∨q). This generalisation means that Kripke structures no longer form an adequate semantics. Instead monotonic modal logics are interpreted over monotonic neighbourhood structures, that is, neighbourhood structures where the neighbourho...
متن کاملAn Algebraic approach to Block Diagram Constructions
We propose an algebraic approach to block diagram construction as an alternative to the classical graph approach inspired by dataflow models. This block diagram algebra is based on three binary operations : sequential, parallel and recursive constructions. These operations can be seen as high level connection schemes that set several connections at once in order to combine two block diagrams to...
متن کامل